Some combinatorial aspects of finite Hamiltonian groups
author
Abstract:
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite Hamiltonian group.
similar resources
some combinatorial aspects of finite hamiltonian groups
in this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite hamiltonian group. the coverings with three proper subgroups and the principal series of such a group are also counted. finally, we give a complete description of the lattice of characteristic subgroups of a finite h...
full textSome Combinatorial Aspects of Reduced Words in Finite Coxeter Groups
We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.
full textRATIONAL CHARACTER TABLE OF SOME FINITE GROUPS
The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...
full textSome Aspects of Groups Acting on Finite Posets
Let P be a finite poset and G a group of automorphisms of P. The action of G on P can be used to define various linear representations of G, and we investigate how these representations are related to one another and to the structure of P. Several examples are analyzed in detail, viz., the symmetric group G, acting on a boolean algebra, CL,(q) acting on subspaces of an n-dimensional vector spac...
full textPairwise non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups
Let $G$ be a finite group. A subset $X$ of $G$ is a set of pairwise non-commuting elements if any two distinct elements of $X$ do not commute. In this paper we determine the maximum size of these subsets in any finite non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup.
full textSome Combinatorial Aspects of Congruence Lattice Representations
A finite distributive latticeD can be representedas the congruence lattice, ConL, of a finite lattice L. We shall discuss the combinatorial aspects of such—and related—representations, specifically, optimal size, breadth, and degree of symmetry.
full textMy Resources
Journal title
volume 39 issue 5
pages 841- 854
publication date 2013-10-15
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023